Generalizing Hopf’s Boundary Point Lemma

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalizing König's infinity lemma

1 Introduction D. Kόnig's famous lemma on trees has many applications; in graph theory it is used to extend certain results from finite to infinite graphs (see Nash-Williams [7]); in logic it can be used to prove that a denumerable set of propositional formulas is satisfiable if every finite subset is (see, for example, Van Fraassen [9]). This last result, known as the compactness theorem for p...

متن کامل

A Boundary Point Lemma for Black-scholes Type Operators

We prove a sharp version of the Hopf boundary point lemma for Black-Scholes type equations. We also investigate the existence and the regularity of the spatial derivative of the solutions at the spatial boundary.

متن کامل

Generalizing Boundary Points

The complexity of numerical domain partitioning depends on the number of potential cut points. In multiway partitioning this dependency is often quadratic, even exponential. Therefore, reducing the number of candidate cut points is important. For a large family of attribute evaluation functions only boundary points need to be considered as candidates. We prove that an even more general property...

متن کامل

Generalizing Newman's Lemma for Left-Linear Rewrite Systems

Confluence criteria for non-terminating rewrite systems are known to be rare and notoriously difficult to obtain. Here we prove a new result in this direction. Our main result is a generalized version of Newman’s Lemma for left-linear term rewriting systems that does not need a full termination assumption. We discuss its relationships to previous confluence criteria, its restrictions, examples ...

متن کامل

Sperner’s Lemma Implies Kakutani’s Fixed Point Theorem

Kakutani’s fixed point theorem has many applications in economics and game theory. One of its most well-known applications is in John Nash’s paper [8], where the theorem is used to prove the existence of an equilibrium strategy in n-person games. Sperner’s lemma, on the other hand, is a combinatorial result concerning the labelling of the vertices of simplices and their triangulations. It is kn...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Canadian Mathematical Bulletin

سال: 2019

ISSN: 0008-4395,1496-4287

DOI: 10.4153/cmb-2017-074-6